SOM-based data visualization methods
نویسنده
چکیده
منابع مشابه
A new approach for data visualization problem
Data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. In this paper, we formulated d...
متن کاملVisual Exploration of Self-Organizing Maps Using the Grand Tour and Linked Brushing
The Self-Organizing Map (SOM) is a popular and well-studied unsupervised learning technique. Much work has been done recently on visualizing the results of the SOM algorithm, using static non-interactive approaches. This paper presents two new SOM visualization methods, based on the grand tour and linked brushing. These new methods use animation to show progress of the algorithm in the input sp...
متن کاملWorldscientiic/ws-b8-5x6-0 Main Chapter 2 the Self-organizing Map as a Tool in Knowledge Engineering
The Self-Organizing Map (SOM) is one of the most popular neural network methods. It is a powerful tool in visualization and analysis of high-dimensional data in various engineering applications. The SOM maps the data on a two-dimensional grid which may be used as a base for various kinds of visual approaches for clustering, correlation and novelty detection. In this chapter, we present novel me...
متن کاملEnhancing Som-based Data Visualization by Linking Diierent Data Projections
The self-organizing map (SOM) is widely used as a data visualization method especially in various engineering applications. It performs a non-linear mapping from a high-dimensional data space to a lower dimensional visualization space. The SOM can be used for example in correlation detection and cluster visualization in explorative manner. In this paper two tools for reeng the SOM-based visuali...
متن کاملThe self-organizing map as a visual neighbor retrieval method
We have recently introduced rigorous goodness criteria for information visualization by posing it as a visual neighbor retrieval problem, where the task is to find proximate high-dimensional data based only on a low-dimensional display. Standard information retrieval criteria such as precision and recall can then be used for information visualization, and we introduced an algorithm, Neighbor Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Intell. Data Anal.
دوره 3 شماره
صفحات -
تاریخ انتشار 1999